Reasoning about Uncertainty and Explicit Ignorance in Generalized Possibilistic Logic
نویسندگان
چکیده
Generalized possibilistic logic (GPL) is a logic for reasoning about the revealed beliefs of another agent. It is a two-tier propositional logic, in which propositional formulas are encapsulated by modal operators that are interpreted in terms of uncertainty measures from possibility theory. Models of a GPL theory represent weighted epistemic states and are encoded as possibility distributions. One of the main features of GPL is that it allows us to explicitly reason about the ignorance of another agent. In this paper, we study two types of approaches for reasoning about ignorance in GPL, based on the idea of minimal specificity and on the notion of guaranteed possibility, respectively. We show how these approaches naturally lead to different flavours of the language of GPL and a number of decision problems, whose complexity ranges from the first to the third level of the polynomial hierarchy.
منابع مشابه
A Logic Programming Framework for Possibilistic Argumentation with Vague Knowledge
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. Defeasible Logic Programming (DeLP) is a defeasible argumentation formalism based on an extension of logic programming. Although DeLP has been successfully integrated in a number of different real-world applications, D...
متن کاملStable Models in Generalized Possibilistic Logic
Possibilistic logic is a well-known logic for reasoning under uncertainty, which is based on the idea that the epistemic state of an agent can be modeled by assigning to each possible world a degree of possibility, taken from a totally ordered, but essentially qualitative scale. Recently, a generalization has been proposed that extends possibilistic logic to a meta-epistemic logic, endowing it ...
متن کاملA logic programming framework for possibilistic argumentation: Formalization and logical properties
In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable...
متن کاملPossibilistic Reasoning - A Mini-Survey and Uniform Semantics
In this paper, we survey some quantitative and qualitative approaches to uncertainty management based on possibility theory and present a logical framework to integrate them. The semantics of the logic is based on the Dempster’s rule of conditioning for possibility theory. It is then shown that classical modal logic, conditional logic, possibilistic logic, quantitative modal logic and qualitati...
متن کاملGentzen Sequent Calculus for Possibilistic Reasoning
Possibilistic logic is an important uncertainty reasoning mech anism based on Zadeh s possibility theory and classical logic The deduc tion rules of possibilistic logic have been obtained from classical resolu tion rule by attaching possibility or necessity weight to ordinary clauses However since not all possibility valued formulae can be converted into equivalent possibilistic clauses the res...
متن کامل